Different types of problems. Standard form.

In this lesson we present the different types of linear programming problems we can face. We refer to problems with unique solution, with multiple solutions, with unbounded solution and those with no feasible solution. We also introduce the standard form of a linear programming problem, which will reveal its important role when explaining the simplex method in a future lesson. Though it is defined for a particular problem, the definiton is valid for any problem.